翻訳と辞書 Words near each other ・ Expanded icosidodecahedron ・ Expanded learning time ・ Expanded memory ・ Expanded metal ・ Expanded Metropolitan Complex of São Paulo ・ Expanded orgasm ・ Expanded polystyrene concrete ・ Expanded Program on Immunization ・ Expanded Program on Immunization (Philippines) ・ Expanded Psionics Handbook ・ Expanded sheet metal ・ Expanded universe ・ Expanded Universe (Heinlein) ・ Expander ・ Expander (song) ・ Expander code ・ Expander cycle ・ Expander graph ・ Expander mixing lemma ・ Expander System Sweden AB ・ Expander walk sampling ・ Expanding Anyway ・ Expanding bullet ・ Expanding Earth ・ Expanding Human ・ Expanding Man ・ Expanding Monomers ・ Expanding nozzle ・ Expanding Senses ・ Expanding toy Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Expander code ： ウィキペディア英語版 Expander code In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs. Along with Justesen codes, expander codes are of particular interest since they have a constant positive rate, a constant positive relative distance, and a constant alphabet size. In fact, the alphabet contains only two elements, so expander codes belong to the class of binary codes. Furthermore, expander codes can be both encoded and decoded in time proportional to the block length of the code. Expander codes are the only known asymptotically good codes which can be both encoded and decoded from a constant fraction of errors in polynomial time. ==Expander codes== In coding theory, an expander code is a $()\_2\backslash ,$ linear block code whose parity check matrix is the adjacency matrix of a bipartite expander graph. These codes have good relative distance $2(1-\backslash varepsilon)\backslash gamma\backslash ,$, where $\backslash varepsilon\backslash ,$ and $\backslash gamma\backslash ,$ are properties of the expander graph as defined later), rate $\backslash left(1-\backslash tfrac\backslash right)\backslash ,$, and decodability (algorithms of running time $O(n)\backslash ,$ exist). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Expander code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.